Regular Language
Q22.
Consider the following two statements : S1: {0^{2n}|n\geq 1|} is a regular language S2 : {0^{m}1^{n}0^{m+n}|m\geq 1 and n\geq 1|} is a regular language Which of the following statements is correct?Q23.
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:Which of the following is the strongest correct statement about a finite language over some finite alphabet \Sigma?Q24.
Consider the following languages : L1 = {ww| w\in {a,b}*} L2 = {ww^{R}| w\in {a,b} *, w^{R} is the reverse of w} L3 = {0^{2i}| i is an integer} L4 ={0^{{i}^{2}} | i is an integer} Which of the languages are regular ?Q25.
Language L1 is defined by the grammar: S_{1}\rightarrow aS_{1}b|\varepsilon Language L2 is defined by the grammar: S_{2}\rightarrow abS_{2}|\varepsilon Consider the following statements: P: L1 is regular Q: L2 is regular Which one of the following is TRUE?Q26.
Given the language L = {ab, aa, baa}, which of the following strings are in L*? 1) abaabaaabaa 2) aaaabaaaa 3) baaaaabaaaab 4) baaaaabaaQ28.
Which of the following languages is (are) non-regular? L_1 = \{0^m1^n \mid 0 \leq m \leq n \leq 10000\} L_2 = \{w \mid w reads the same forward and backward\} L_3 = \{w \in \{0, 1\} ^* \mid w contains an even number of 0's and an even number of 1's\}Q29.
S\rightarrowaSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set ofQ30.
Let L_{1}=\{w \in \{0,1\}*|w has at least as many occurrences of (110)'s as (011)'s}. Let L_{2}=\{w \in \{0,1\}*|w has at least as many occurrence of (000)'s as (111)'s}. Which one of the following is TRUE?